Duality for semilattice representations
نویسنده
چکیده
The paper presents general machinery for extending a duality between complete, cocomplete categories to a duality between corresponding categories of semilattice representations (i.e. sheaves over Alexandrov spaces). This enables known dualities to be regularized. Among the applications, regularized Lindenbaun-Tarski duality shows that the weak extension of Boolean logic (i.e. the semantics of PASCAL-like programming languages) is the logic for semilatticeindexed systems of sets. Another application enlarges Pontryagin duality by regularizing it to obtain duality for commutative inverse Clifford monoids. 1991 AMS Subj. Class.: 18A25, 18F20, 06F30, 06E15, 22D35, 43A40
منابع مشابه
Conndence Relations and Ordinal Information 1
We deene conndence relations on Boolean lattices, which can be interpreted as ordinal representations of uncertainty or information. The set of the conndence relations on a given Boolean lattice can be ordered by set inclusion and thus is shown to form a complete meet-semilattice. We investigate and identify the maximal elements of this structure. Moreover, we prove that it is in particular an ...
متن کاملConfidence relations and ordinal information 1
We define confidence relations on Boolean lattices, which can be interpreted as ordinal representations of uncertainty or information. The set of the confidence relations on a given Boolean lattice can be ordered by set inclusion and thus is shown to form a complete meet-semilattice. We investigate and identify the maximal elements of this structure. Moreover, we prove that it is in particular ...
متن کاملA relation between the theory of formal concepts and multiway clustering
Contexts where entity descriptions belong to a meet-semilattice are considered. When the entity set is finite, we show that nonempty extensions of concepts assigned to such contexts coincide, casewise, with strong or weak clusters associated with some pairwise or multiway dissimilarity measure. Moreover, by duality principle, a similar result holds when entity descriptions belong to a join-semi...
متن کاملTight Representations of Semilattices and Inverse Semigroups
By a Boolean inverse semigroup we mean an inverse semigroup whose semilattice of idempotents is a Boolean algebra. We study representations of a given inverse semigroup S in a Boolean inverse semigroup which are tight in a certain well defined technical sense. These representations are supposed to preserve as much as possible any trace of Booleannes present in the semilattice of idempotents of ...
متن کاملOn some semilattice structures for production technologies
Tracing back from Charnes, Cooper and Rhodes [9] many approaches have been proposed to extend the DEA production model to non-convex technologies. The FDH method were introduced by Deprins, Simar and Tulkens [13] and it only assumes a free disposal assumption of the technology. This paper, continues further an earlier work by Briec and Horvath [7]. Among other things, a new class of semilattice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003